K-regular Antichains on [m] with K ≤ M-2
نویسنده
چکیده
Let 2 be ordered by set inclusion and let B ⊆ 2 be an antichain of size n := |B|. An antichain B is k-regular for some non-negative integer k, if for each i ∈ [m] there are exactly k sets B1, B2, . . . , Bk ∈ B containing i. In this case we say that B is a (k, m, n)-antichain. Let 2 ≤ k ≤ m − 2 be positive integers. In this paper we show that a (k, m, n)-antichain exists if and only if k + 1 ≤ n ≤ km 2 .
منابع مشابه
Completely separating systems of k-sets for (k-12) ≤ n < (k2) or 11 ≤ k ≤ 12
Here R(n, k) denotes the minimum possible size of a completely separating system C on [n] with |A| = k for each A ∈ C. Values of R(n, k) are determined for ( k−1 2 ) ≤ n < (k 2 ) or 11 ≤ n ≤ 12. Using the dual interpretation of completely separating systems as antichains, this paper provides corresponding results for dual k-regular antichains.
متن کاملRelationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کاملSeparating Systems of k - sets for k = 11 or k = 12
R(n,k) denotes the minimum possible size of a completely separating system C on {1,2,…,n} with |A|=k for each set A of C. Values of R(n,k) are determined for k=11 or k=12 and several other results are mentioned. Using the dual interpretation of completely separating systems as antichains, it provides corresponding results for dual k-regular antichains.
متن کاملAntichains of Multisets
The problem of enumeration of m-antichains of k-bounded multisets on an n-set is considered. A formula for calculating the cardinality of the corresponding family in terms of the graph theory was obtained. A more general case of multiantichains is also considered. As an illustration the corresponding explicit formulas are given for the case when 1 ≤ m ≤ 4, k ≥ 1 and n ≥ 0.
متن کاملOn the size of maximal antichains and the number of pairwise disjoint maximal chains
Fix integers n and k with n ≥ k ≥ 3. Duffus and Sands proved that if P is a finite poset and n ≤ |C| ≤ n+ (n− k)/(k− 2) for every maximal chain in P , then P must contain k pairwise disjoint maximal antichains. They also constructed a family of examples to show that these inequalities are tight. These examples are 2-dimensional which suggests that the dual statement may also hold. In this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 53 شماره
صفحات -
تاریخ انتشار 2012